Convex Sets and Nearest Points. Ip

نویسنده

  • R. R. PHELPS
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Remotality and proximinality in normed linear spaces

In this paper, we consider the concepts farthest points and nearest points in normed linear spaces, We obtain a necessary and coecient conditions for proximinal, Chebyshev, remotal and uniquely remotal subsets in normed linear spaces. Also, we consider -remotality, -proximinality, coproximinality and co-remotality.

متن کامل

Convexity and Geodesic Metric Spaces

In this paper, we first present a preliminary study on metric segments and geodesics in metric spaces. Then we recall the concept of d-convexity of sets and functions in the sense of Menger and study some properties of d-convex sets and d-convex functions as well as extreme points and faces of d-convex sets in normed spaces. Finally we study the continuity of d-convex functions in geodesic metr...

متن کامل

Sweep Line Algorithm for Convex Hull Revisited

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

متن کامل

Concave hull: A k-nearest neighbours approach for the computation of the region occupied by a set of points

This paper describes an algorithm to compute the envelope of a set of points in a plane, which generates convex or non-convex hulls that represent the area occupied by the given points. The proposed algorithm is based on a k-nearest neighbours approach, where the value of k, the only algorithm parameter, is used to control the “smoothness” of the final solution. The obtained results show that t...

متن کامل

Bishop-Phelps type Theorem for Normed Cones

In this paper the notion of  support points of convex sets  in  normed cones is introduced and it is shown that in a  continuous normed cone, under the appropriate conditions, the set of support points of a  bounded Scott-closed convex set is nonempty. We also present a Bishop-Phelps type Theorem for normed cones.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010